Server Models for Probabilistic Network Calculus

نویسنده

  • Markus Fidler
چکیده

Network calculus is a deterministic queuing theory that has gained increasing attention in recent time. Founded on min-plus algebra it resorts to intuitive convolution formulae for efficient concatenation of servers and derivation of related performance bounds. Yet, the pessimistic worst-case analysis of deterministic network calculus gave rise to probabilistic counterparts that aim at utilizing the smoothing effects of statistical multiplexing by allowing for certain violation probabilities. Related theories are, however, significantly more complicated and still subject to research. To advance theory this paper evolves server models for probabilistic network calculus that are based on moment generating functions to efficiently utilize statistical multiplexing and the independence of flows.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of Stochastic Service Guarantees in Communication Networks: A Server Model

Many communication networks such as wireless networks only provide stochastic service guarantees. For analyzing stochastic service guarantees, research effort has been made in the past few years to develop stochastic network calculus, a probabilistic version of (min, +) deterministic network calculus. However, many challenges have made the development difficult. Some of them are closely related...

متن کامل

Performance Analysis of a Cognitive Radio Network Using Network Calculus

Cognitive radio has become a promising technology to increase spectrum utilization through spectrum sharing between licensed users (primary users) and unlicensed users (secondary users). Performance evaluation and analysis is of key importance to get more knowledge of this newly emerged technology. Queueing theory and Markov chain model have been applied to conduct the analysis, where some resu...

متن کامل

Rule-based joint fuzzy and probabilistic networks

One of the important challenges in Graphical models is the problem of dealing with the uncertainties in the problem. Among graphical networks, fuzzy cognitive map is only capable of modeling fuzzy uncertainty and the Bayesian network is only capable of modeling probabilistic uncertainty. In many real issues, we are faced with both fuzzy and probabilistic uncertainties. In these cases, the propo...

متن کامل

Probabilistic Relational Models of On-line User Behavior Early Explorations

We propose the usefulness of probabilistic relational methods for modeling user behavior at web sites. Web logs (aka "click streams"), server logs, and other data sources, taken as datasets for traditional machine learning algorithms, violate the iid assumption of most algorithms. Requests ("clicks") are not independent within a session, sessions for a visitor are not independent of one another...

متن کامل

Quality-of-service performance bounds in wireless multi-hop relaying networks

The theoretical analysis on quality-of-service (QoS) performances is required to provide the guides for the developments of the next-generation wireless networks. As a good analysis tool, the probabilistic network calculus with moment generating functions (MGFs) recently can be used for delay and backlog performance measures in wireless networks. Different from the existed studies which mostly ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005